Diffie-Hellman exponent

Diffie-Hellman exponent
показатель экспоненты в алгоритме обмена ключами Диффи-Хеллмана

English-Russian cryptological dictionary . 2014.

Смотреть что такое "Diffie-Hellman exponent" в других словарях:

  • Diffie–Hellman key exchange — (D–H)[nb 1] is a specific method of exchanging keys. It is one of the earliest practical examples of key exchange implemented within the field of cryptography. The Diffie–Hellman key exchange method allows two parties that have no prior knowledge …   Wikipedia

  • Whitfield Diffie — Diffie redirects here. For the country music singer, see Joe Diffie. Whitfield Diffie Born June 5, 1944 …   Wikipedia

  • показатель экспоненты в алгоритме обмена ключами Диффи-Хеллмана — — [http://www.rfcmd.ru/glossword/1.8/index.php?a=index d=23] Тематики защита информации EN Diffie Hellman exponent …   Справочник технического переводчика

  • Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… …   Wikipedia

  • Computer security compromised by hardware failure — is a branch of computer security applied to hardware. The objective of computer security includes protection of information and property from theft, corruption, or natural disaster, while allowing the information and property to remain accessible …   Wikipedia

  • Three-pass protocol — In cryptography, the three pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. This message protocol should not be… …   Wikipedia

  • RSA — In cryptography, RSA is an algorithm for public key cryptography. It is the first algorithm known to be suitable for signing as well as encryption, and one of the first great advances in public key cryptography. RSA is widely used in electronic… …   Wikipedia

  • Primitive Wurzel — Als Primitivwurzeln werden in der Zahlentheorie, einem Teilgebiet der Mathematik bestimmte Elemente von primen Restklassengruppen bezeichnet. Die besondere Eigenschaft einer Primitivwurzel ist, dass jedes Element der primen Restklassengruppe als… …   Deutsch Wikipedia

  • Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) …   Wikipedia

  • Paul Kocher — Infobox Scientist name = Paul C. Kocher caption = birth date = Birth date and age|1973|6|11|df=y birth place = New York death date = death place = ethnicity = residence = United States nationality American field = Cryptography work institution =… …   Wikipedia

  • Plaintext-aware encryption — Plaintext awareness is a notion of security for public key encryption. A cryptosystem is plaintext aware if it is difficult for any efficient algorithm to come up with a valid ciphertext without being aware of the corresponding plaintext.From a… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.